Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming
نویسندگان
چکیده
In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size M can be sequentially written in the WOM storage at least t-times. In this paper, a WOM storage is modeled by a state transition graph. The proposed construction has the following two features. First, it includes a systematic method to determine the encoding regions in the state transition graph. Second, the proposed construction includes a labeling method for states by using integer programming. Several novel WOM codes for q level flash memories with 2 cells are constructed by the proposed construction. They achieve the worst numbers of writes t that meet the known upper bound in the range 4 ≤ q ≤ 8, M = 8. In addition, we constructed fixed rate non-binary WOM codes with the capability to reduce ICI (inter cell interference) of flash cells. One of the advantages of the proposed construction is its flexibility. It can be applied to various storage devices, to various dimensions (i.e, number of cells), and various kind of additional constraints.
منابع مشابه
Geometric WOM codes and coding strategies for multilevel flash memories
This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx [1], we present a construction of WOM codes based on finite Euclidean geometries over F2. This construction yields WOM codes with new parameters and provides insight into the criterion that incidence structures should satisfy to give rise to good codes. We also an...
متن کاملDISCRETE TOMOGRAPHY AND FUZZY INTEGER PROGRAMMING
We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.
متن کاملNew upper bounds on binary linear codes and a ℤ4-code with a better-than-linear Gray image
Using integer linear programming and table-lookups we prove that there is no binary linear [1988, 12, 992] code. As a byproduct, the non-existence of binary linear [324, 10, 160], [356, 10, 176], [772, 11, 384], and [836, 11, 416] codes is shown. On the other hand, there exists a linear (994, 4, 992) code over Z4. Its Gray image is a binary non-linear (1988, 2, 992) code. Therefore, we can add ...
متن کاملFlux Distribution in Bacillus subtilis: Inspection on Plurality of Optimal Solutions
Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 100-A شماره
صفحات -
تاریخ انتشار 2017